A Fully Discrete Adjoint Method for Optimization of Flow Problems on Deforming Domains with Time-Periodicity Constraints

نویسندگان

  • M. J. Zahra
  • P.-O. Persson
  • J. Wilkening
چکیده

A variety of shooting methods for computing fully discrete time-periodic solutions of partial differential equations, including Newton-Krylov and optimization-based methods, are discussed and used to determine the periodic, compressible, viscous flow around a 2D flapping airfoil. The Newton-Krylov method uses matrix-free GMRES to solve the linear systems of equations that arise in the nonlinear iterations, with matrix-vector products computed via the linearized sensitivity evolution equations. The adjoint method is used to compute gradients for the gradient-based optimization shooting methods. The Newton-Krylov method is shown to exhibit superior convergence to the optimal solution for these fluid problems, and fully leverages quality starting data. The central contribution of this work is the derivation of the adjoint equations and the corresponding adjoint method for fully discrete, time-periodically constrained partial differential equations. These adjoint equations constitute a linear, two-point boundary value problem that is provably solvable. The periodic adjoint method is used to compute gradients of quantities of interest along the manifold of time-periodic solutions of the discrete partial differential equation, which is verified against a second-order finite difference approximation. These gradients are then used in a gradient-based optimization framework to determine the energetically optimal flapping motion of a 2D airfoil in compressible, viscous flow over a single cycle, such that the time-averaged thrust is identically zero. In less than 20 optimization iterations, the flapping energy was reduced nearly an order of magnitude and the thrust constraint satisfied to 5 digits of accuracy.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solution of the Unsteady Discrete Adjoint for Three-Dimensional Problems on Dynamically Deforming Unstructured Meshes

The formulation and solution of the adjoint problem for unsteady flow simulations using the Reynolds-averaged Navier-Stokes equations in the presence of dynamically deforming unstructured meshes is demonstrated. A discrete adjoint approach is used, and the full linearization is built up in a systematic and modular fashion. Discrete conservation in the analysis problem is ensured through the geo...

متن کامل

PERFORMANCE OF DIFFERENT ANT-BASED ALGORITHMS FOR OPTIMIZATION OF MIXED VARIABLE DOMAIN IN CIVIL ENGINEERING DESIGNS

Ant colony optimization algorithms (ACOs) have been basically introduced to discrete variable problems and applied to different research domains in several engineering fields. Meanwhile, abundant studies have been already involved to adapt different ant models to continuous search spaces. Assessments indicate competitive performance of ACOs on discrete or continuous domains. Therefore, as poten...

متن کامل

Discrete Adjoint Approach for Aerodynamic Sensitivity Analysis and Shape Optimization on Overset Mesh System

In the present talk, the strategies to apply the sensitivity analysis method to aerodynamic shape optimization problems of complex geometries are intensively discussed. To resolve the design of complicated aircraft geometries such as high-lift devices, wing/body configurations, overset mesh techniques are adopted. In addition, a noticeable sensitivity analysis method, adjoint approach, which sh...

متن کامل

Interactive multiple objective programming in optimization of the fully fuzzy quadratic programming problems

In this paper, a quadratic programming (FFQP) problem is considered in which all of the cost coefficients, constraints coefficients, and right hand side of the constraints are characterized by L-R fuzzy numbers. Through this paper, the concept of α- level of fuzzy numbers for the objective function, and the order relations on the fuzzy numbers for the constraints are considered.  To optimize th...

متن کامل

DISCRETE AND CONTINUOUS SIZING OPTIMIZATION OF LARGE-SCALE TRUSS STRUCTURES USING DE-MEDT ALGORITHM

Design optimization of structures with discrete and continuous search spaces is a complex optimization problem with lots of local optima. Metaheuristic optimization algorithms, due to not requiring gradient information of the objective function, are efficient tools for solving these problems at a reasonable computational time. In this paper, the Doppler Effect-Mean Euclidian Distance Threshold ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016